Search results for "Greedy algorithms"

showing 1 items of 1 documents

Whom to befriend to influence people

2020

Alice wants to join a new social network, and influence its members to adopt a new product or idea. Each person $v$ in the network has a certain threshold $t(v)$ for {\em activation}, i.e adoption of the product or idea. If $v$ has at least $t(v)$ activated neighbors, then $v$ will also become activated. If Alice wants to activate the entire social network, whom should she befriend? More generally, we study the problem of finding the minimum number of links that a set of external influencers should form to people in the network, in order to activate the entire social network. This {\em Minimum Links} Problem has applications in viral marketing and the study of epidemics. Its solution can be…

FOS: Computer and information sciencesPhysics - Physics and SocietyGeneral Computer ScienceFOS: Physical sciencesPhysics and Society (physics.soc-ph)0102 computer and information sciences02 engineering and technology01 natural sciencesSocial networksGraphTheoretical Computer ScienceCombinatoricsComputer Science - Data Structures and AlgorithmsGreedy algorithmFOS: Mathematics0202 electrical engineering electronic engineering information engineeringMathematics - CombinatoricsData Structures and Algorithms (cs.DS)Greedy algorithmTime complexityNP-completeMathematicsSocial and Information Networks (cs.SI)Social networkDiscrete mathematicsBinary treeDegree (graph theory)Computer Science (all)Order (ring theory)Computer Science - Social and Information NetworksJoin (topology)Influence maximizationGreedy algorithms010201 computation theory & mathematicsGraphs; Greedy algorithms; Influence maximization; NP-complete; Social networksProduct (mathematics)020201 artificial intelligence & image processingCombinatorics (math.CO)Constant (mathematics)GraphsTheoretical Computer Science
researchProduct